The unification problem for one relation Thue Systems
Identifieur interne : 00B312 ( Main/Exploration ); précédent : 00B311; suivant : 00B313The unification problem for one relation Thue Systems
Auteurs : Christopher Lynch [États-Unis]Source :
- Lecture Notes in Computer Science [ 0302-9743 ]
Abstract
Abstract: We give an algorithm for the unification problem for a generalization of Thue Systems with one relation. The word problem is a special case. We show that in many cases this is a decision procedure with at most an exponential time bound. We conjecture that this is always a decision procedure.
Url:
DOI: 10.1007/BFb0055913
Affiliations:
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: 001941
- to stream Istex, to step Curation: 001922
- to stream Istex, to step Checkpoint: 002544
- to stream Main, to step Merge: 00BA34
- to stream Main, to step Curation: 00B312
Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">The unification problem for one relation Thue Systems</title><author><name sortKey="Lynch, Christopher" sort="Lynch, Christopher" uniqKey="Lynch C" first="Christopher" last="Lynch">Christopher Lynch</name></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:6D1BF74E9DCB70B14E9406D89FEC64E7F4D257A6</idno><date when="1998" year="1998">1998</date><idno type="doi">10.1007/BFb0055913</idno><idno type="url">https://api.istex.fr/ark:/67375/HCB-QCTZFSCZ-S/fulltext.pdf</idno><idno type="wicri:Area/Istex/Corpus">001941</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">001941</idno><idno type="wicri:Area/Istex/Curation">001922</idno><idno type="wicri:Area/Istex/Checkpoint">002544</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Checkpoint">002544</idno><idno type="wicri:doubleKey">0302-9743:1998:Lynch C:the:unification:problem</idno><idno type="wicri:Area/Main/Merge">00BA34</idno><idno type="wicri:Area/Main/Curation">00B312</idno><idno type="wicri:Area/Main/Exploration">00B312</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">The unification problem for one relation Thue Systems</title><author><name sortKey="Lynch, Christopher" sort="Lynch, Christopher" uniqKey="Lynch C" first="Christopher" last="Lynch">Christopher Lynch</name><affiliation wicri:level="2"><country xml:lang="fr">États-Unis</country><wicri:regionArea>Department of Mathematics and Computer Science, Clarkson University, Box 5815, 13699-5815, Potsdam, NY</wicri:regionArea><placeName><region type="state">État de New York</region></placeName></affiliation><affiliation wicri:level="1"><country wicri:rule="url">États-Unis</country></affiliation></author></analytic><monogr></monogr><series><title level="s" type="main" xml:lang="en">Lecture Notes in Computer Science</title><title level="s" type="abbrev">Lect Notes Comput Sci</title><idno type="ISSN">0302-9743</idno><idno type="eISSN">1611-3349</idno><idno type="ISSN">0302-9743</idno></series></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0302-9743</idno></seriesStmt></fileDesc><profileDesc><textClass></textClass></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">Abstract: We give an algorithm for the unification problem for a generalization of Thue Systems with one relation. The word problem is a special case. We show that in many cases this is a decision procedure with at most an exponential time bound. We conjecture that this is always a decision procedure.</div></front></TEI><affiliations><list><country><li>États-Unis</li></country><region><li>État de New York</li></region></list><tree><country name="États-Unis"><region name="État de New York"><name sortKey="Lynch, Christopher" sort="Lynch, Christopher" uniqKey="Lynch C" first="Christopher" last="Lynch">Christopher Lynch</name></region><name sortKey="Lynch, Christopher" sort="Lynch, Christopher" uniqKey="Lynch C" first="Christopher" last="Lynch">Christopher Lynch</name></country></tree></affiliations></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Main/Exploration
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 00B312 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 00B312 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Lorraine
|area= InforLorV4
|flux= Main
|étape= Exploration
|type= RBID
|clé= ISTEX:6D1BF74E9DCB70B14E9406D89FEC64E7F4D257A6
|texte= The unification problem for one relation Thue Systems
}}
| This area was generated with Dilib version V0.6.33. |  |